The multiplication table for smooth integers
نویسندگان
چکیده
The Erdős multiplication table problem asks how many distinct integers appear in the N × table. order of magnitude this quantity was determined by Ford [8] . In paper we study number y -smooth entries table, that is to say with no prime factors greater than
منابع مشابه
On the Number of Integers in a Generalized Multiplication Table
Motivated by the Erdős multiplication table problem we study the following question: Given numbers N1, . . . , Nk+1, how many distinct products of the form n1 · · ·nk+1 with 1 ≤ ni ≤ Ni for i ∈ {1, . . . , k + 1} are there? Call Ak+1(N1, . . . , Nk+1) the quantity in question. Ford established the order of magnitude of A2(N1, N2) and the author of Ak+1(N, . . . , N) for all k ≥ 2. In the presen...
متن کاملThe multiplication table problem for bipartite graphs
We investigate the following generalisation of the ‘multiplication table problem’ of Erdős: given a bipartite graph with m edges, how large is the set of sizes of its induced subgraphs? Erdős’s problem, posed in 1955, of estimating the number of distinct products ab with a, b ≤ n is precisely the problem under consideration when the graph in question is the complete bipartite graph Kn,n. In thi...
متن کاملMultiplication of Long Integers - Faster than Long Multiplication
The multiplication of a by a single digit is called short multiplication, and the whole method to compute a × b is called long multiplication. For integers a and b with very many digits, long multiplication does indeed take long, even if carried out by a modern computer. Calculations with very long integers are used in many applications of computers, for example, in the encryption of communicat...
متن کاملFactoring Odd Integers without Multiplication and Division
A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and subtraction throughout. Presentation of material is non-theoretical; intended to be accessible to a broader audience of non academic and theoretical practitioners.
متن کاملApproximation of the Multiplication Table Function
In this paper, considering the concept of Universal Multiplication Table, we show that for every n ≥ 2, the inequality: M(n) = #{ij|1 ≤ i, j ≤ n} ≥ n2 N(n2) , holds true with: N(n) = n log 2 log log n ( 1+ 387 200 log log n )
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2021
ISSN: ['0022-314X', '1096-1658']
DOI: https://doi.org/10.1016/j.jnt.2020.09.019